Veryfying Parameterized Networks using Abstraction and Regular Languages
نویسندگان
چکیده
This paper describes a technique based on network grammars and abstraction to verify families of state transition systems The family of state transition systems is represented by a context free network grammar Using the structure of the network grammar our tech nique constructs an invariant which simulates all the state transition systems in the family A novel idea used in this paper is to use regular languages to express state properties We have implemented our techniques and veri ed two non trivial examples
منابع مشابه
Verifying Parameterized Networks usingAbstraction and Regular Languages ?
This paper describes a technique based on network grammars and abstraction to verify families of state-transition systems. The family of state-transition systems is represented by a context-free network grammar. Using the structure of the network grammar our technique constructs an invariant which simulates all the state-transition systems in the family. A novel idea used in this paper is to us...
متن کاملBeyond Regular Model Checking
In recent years, it has been established that regular model checking can be successfully applied to several parameterized veriication problems. However, there are many parameterized veriication problems that cannot be described by regular languages, and thus cannot be veri-ed using regular model checking. In this study we try to practice symbolic model checking using classes of languages more e...
متن کاملCoCaml: Functional Programming with Regular Coinductive Types
Functional languages offer a high level of abstraction, which results in programs that are elegant and easy to understand. Central to the development of functional programming are inductive and coinductive types and associated programming constructs, such as pattern-matching. Whereas inductive types have a long tradition and are well supported in most languages, coinductive types are subject of...
متن کاملLanguage-Based Abstraction Refinement for Hybrid System Verification
The standard counterexample-guided abstraction-refinement (cegar) approach uses finite transition systems as abstractions of concrete systems. We present an approach to represent and refine abstractions of infinite-state systems that uses regular languages instead of finite transition systems. The advantage of using languages over transition systems is that we can store more fine-grained inform...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کامل